منابع مشابه
Topology of Matching, Chessboard, and General Bounded Degree Graph Complexes
We survey results and techniques in the topological study of simplicial complexes of (di-, multi-, hyper-)graphs whose node degrees are bounded from above. These complexes have arisen is a variety of contexts in the literature. The most wellknown examples are the matching complex and the chessboard complex. The topics covered here include computation of Betti numbers, representations of the sym...
متن کاملGraph Partitioning and Traffic Grooming with Bounded Degree Request Graph
We study a graph partitioning problem which arises from traffic grooming in optical networks. We wish to minimize the equipment cost in a SONET WDM ring network by minimizing the number of Add-Drop Multiplexers (ADMs) used. We consider the version introduced by Muñoz and Sau [12] where the ring is unidirectional with a grooming factor C, and we must design the network (namely, place the ADMs at...
متن کاملDistributional Learning of Regular Formal Graph System of Bounded Degree
In this paper, we describe how distributional learning techniques can be applied to formal graph system (FGS) languages. Formal graph system is a logic program that deals with term graphs instead of the terms of first-order predicate logic. We show that the FGS languages of bounded degree with the 1-finite context property (1-FCP) and the bounded treewidth property can be learned from positive ...
متن کاملThe Ramsey number of a graph with bounded maximum degree
The Ramsey number of a graph G is the least number t for which it is true that whenever the edges of the complete graph on t vertices are colored in an arbitrary fashion using two colors, say red and blue, then it is always the case that either the red subgraph contains G or the blue subgraph contains G. A conjecture of P. Erdos and S. Burr is settled in the afftrmative by proving that for each...
متن کاملOn Testing Bipartiteness in the Bounded-Degree Graph Model
This memo presents a variant of the known tester of Bipartiteness in the bounded-degree graph model, which is presented in Section 9.4.1 of my book on Property Testing (hereafter referred to as the book). The purpose of this variation is to show that, when the graph is rapid mixing, Bipartiteness can be tested in O( √ k) time, rather than in Õ( √ k) time. Much of the following text is reproduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2003
ISSN: 0021-8693
DOI: 10.1016/s0021-8693(03)00024-3